Translating active objects into colored Petri nets for communication analysis
نویسندگان
چکیده
منابع مشابه
Translating Active Objects into Colored Petri Nets for Communication Analysis
Actor-based languages attract attention for their ability to scale to highly parallel architectures. Active objects combine the asynchronous communication of actors with object-oriented programming by means of asynchronous method calls and synchronization on futures. However, the combination of asynchronous calls and synchronization introduces communication cycles which lead to a form of commun...
متن کاملUsing Petri Nets for Specifying Active Objects and Generative Communication
This paper presents an introduction to an approach for modelling, implementing and reasoning upon systems, based on principles of concurrent object-orientation, generative communication and Petri nets. The approach is illustrated through a case study, proposed by C. Sibertin-Blanc. The case is a variant of the well known dining philosophers problem, called \the Hurried Philosophers" problem.
متن کاملMPath2PN - Translating metabolic pathways into Petri nets
We propose MPath2PN, a tool which automatically translates metabolic pathways, as described in the major biological databases, into corresponding Petri net representations. The aim is to allow for a systematic reuse, in the setting of metabolic pathways, of the variety of tools existing for Petri net analysis and simulation. The current prototype implementation of MPath2PN inputs the KEGG descr...
متن کاملThroughput analysis in timed colored Petri nets
It is shown that the steady-state behavior of a class of timed colored Petri nets can be analyzed using the concept of throughput and simple rules of operational analysis. Since such analysis is based on the average values of firing times rather than firing time distribution functions, the same approach ca be applied to a variety of net models. Throughput analysis is based on S t N C t U d prop...
متن کاملBackward Reachability Analysis of Colored Petri Nets
This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic asso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2019
ISSN: 0167-6423
DOI: 10.1016/j.scico.2019.04.002